On the multiplicity in Pillai's problem with Fibonacci numbers and powers of a fixed prime
نویسندگان
چکیده
Let \( \{F_n\}_{n\geq 0} \) be the sequence of Fibonacci numbers and let \(p\) a prime. For an integer \(c\) we write \(m_{F,p}(c)\) for number distinct representations as \(F_k-p^\ell\) with \(k\ge 2\) \(\ell\ge 0\). We prove that \(m_{F,p}(c)\le 4\).
منابع مشابه
Small Prime Powers in the Fibonacci Sequence
It is shown that there are no non-trivial fifth-, seventh-, eleventh-, thirteenthor seventeenth powers in the Fibonacci sequence. For eleventh, thirteenthand seventeenth powers an alternative (to the usual exhaustive check of products of powers of fundamental units) method is used to overcome the problem of having a large number of independent units and relatively high bounds on their exponents...
متن کاملOn irregular prime powers of Bernoulli numbers
In this paper we will examine the occurrence of irregular prime powers of Bernoulli numbers. This will lead us to an extended definition of irregular pairs of higher order. Consequently an easy criterion will show whether irregular prime powers exist. Applications to p-adic zeta functions and Iwasawa theory will follow.
متن کاملon translation of politeness strategies in dialogues involving female characters in translations and retranslations of novels translated before and after the islamic revolution of iran and their effects on the image of women: a polysystem theory approach
abstract reception environment has considerable effects on accepting a translation. as the expectations of a target culture and its values and needs change throughout history, its criteria for accepting a translation or rejecting it will change accordingly (gentzler, 2001). the expectations of iran, as the reception environment in the present study, have changed after the islamic revolution. i...
Generalized Fibonacci Sequences modulo Powers of a Prime
Let us begin by defining a generalized Fibonacci sequence (gn) with all gn in some abelian group as a sequence that satisfies the recurrence gn = gn−1 + gn−2 as n ranges over Z. The Fibonacci sequence (Fn) is the generalized Fibonacci sequence with integer values defined by F0 = 0 and F1 = 1. Recall also the Binet formula: for any integer n, Fn = (α − β)/ √ 5, where α = (1 + √ 5)/2 and β = (1− ...
متن کاملthe effect of task cognitive complexity and time limit on the performance of the learners with different proficiency levels in second language writing skill
this study investigated the effects of manipulating the cognitive complexity of tasks along +/- few elements and the time limits on l2 learners writing performance. to conduct the study, 60 iranian efl learners with two levels of proficiency, low and high intermediate, were selected and assigned to three groups based on the time devoted to task completion. the participants performed both a simp...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasnik Matematicki
سال: 2022
ISSN: ['1846-7989', '0017-095X']
DOI: https://doi.org/10.3336/gm.57.2.02